On the Bias of Reed--Muller Codes over Odd Prime Fields
نویسندگان
چکیده
منابع مشابه
List decoding Reed-Muller codes over small fields
The list decoding problem for a code asks for the maximal radius up to which any ball of that radius contains only a constant number of codewords. The list decoding radius is not well understood even for well studied codes, like Reed-Solomon or Reed-Muller codes. Fix a finite field F. The Reed-Muller code RMF(n, d) is defined by n-variate degree-d polynomials over F. In this work, we study the ...
متن کاملOn the Reed-Muller codes
We give a brief but complete account of all the essential facts concerning the Reed-Muller and punctured Reed-Muller codes. The treatment is new and includes an easy, direct proof of the fact that the punctured Reed-Muller codes are the codes of the projective geometries over the binary eld. We also establish the existence of two short exact sequences that lead to new proofs that the minimum-we...
متن کاملGeometric Codes over Fields of Odd Prime Power Order
We obtain improved bounds for the minimum weight of the dual codes associated with the codes from finite geometries in the case of odd order, and some results that apply also to the dual codes of non-desarguesian planes of odd order.
متن کاملDecoding Reed-Muller Codes Over Product Sets
We give a polynomial time algorithm to decode multivariate polynomial codes of degree d up to half their minimum distance, when the evaluation points are an arbitrary product set S, for every d < |S|. Previously known algorithms could achieve this only if the set S had some very special algebraic structure, or if the degree d was significantly smaller than |S|. We also give a near-linear time r...
متن کاملGeneralized Reed-Muller codes over Galois rings
Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2020
ISSN: 0895-4801,1095-7146
DOI: 10.1137/18m1215104